Maximum entropy estimation for survey sampling
نویسندگان
چکیده
منابع مشابه
Maximum Entropy Estimation for Survey sampling
Calibration methods have been widely studied in survey sampling over the last decades. Viewing calibration as an inverse problem, we extend the calibration technique by using a maximum entropy method. Finding the optimal weights is achieved by considering random weights and looking for a discrete distribution which maximizes an entropy under the calibration constraint. This method points a new ...
متن کاملMaximum Entropy Sampling
Information " Chance and chance alone has a message for us. Everything that occurs out of necessity, everything expected, repeated day in and day out, is mute. Only chance can speak to us. We read its message much as gypsies read the images made by coffee grounds at the bottom of a cup. "-Milan Kundera (The Unbearable Lightness of Being) Entropy " I propose to name the magnitude S the entropy o...
متن کاملMaximum-entropy remote sampling
We consider the “remote-sampling” problem of choosing a subset S, with |S|= s, from a set N of observable random variables, so as to obtain as much information as possible about a set T of target random variables which are not directly observable. Our criterion is that of minimizing the entropy of T conditioned on S. We con ne our attention to the case in which the random variables have a joint...
متن کاملContinuous Relaxations for Constrained Maximum-Entropy Sampling
We consider a new nonlinear relaxation for the Constrained Maximum Entropy Sampling Problem { the problem of choosing the s s principal submatrix with maximal determinant from a given n n positive deenite matrix, subject to linear constraints. We implement a branch-and-bound algorithm for the problem, using the new relaxation. The performance on test problems is far superior to a previous imple...
متن کاملNew Upper Bounds for Maximum - Entropy Sampling
We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer's inequality. Further new upper bounds combine the use of Fischer's inequality with previously developed bounds. We demonstrate this in detail by using the partitioning idea to strengthen the spectral bounds of Ko, Lee and Queyranne and of Lee. Computat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Planning and Inference
سال: 2011
ISSN: 0378-3758
DOI: 10.1016/j.jspi.2010.06.002